Adhesive and quasiadhesive categories
نویسندگان
چکیده
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories. 1991 Mathematics Subject Classification. 18D99, 18A30, 18A35, 68Q42, 68Q65.
منابع مشابه
Quasitoposes, Quasiadhesive Categories and Artin Glueing
Adhesive categories are a class of categories in which pushouts along monos are well-behaved with respect to pullbacks. Recently it has been shown that any topos is adhesive. Many examples of interest to computer scientists are not adhesive, a fact which motivated the introduction of quasiadhesive categories. We show that several of these examples arise via a glueing construction which yields q...
متن کاملOn the Axioms for Adhesive and Quasiadhesive Categories
A category is adhesive if it has all pullbacks, all pushouts along monomorphisms, and all exactness conditions between pullbacks and pushouts along monomorphisms which hold in a topos. This condition can be modified by considering only pushouts along regular monomorphisms, or by asking only for the exactness conditions which hold in a quasitopos. We prove four characterization theorems dealing ...
متن کاملAlgebraic High-Level Nets as Weak Adhesive HLR Categories
Adhesive high-level replacement (HLR) system have been recently introduced as a new categorical framework for graph transformation in the double pushout approach [1, 2]. They combine the well-known framework of HLR systems with the framework of adhesive categories introduced by Lack and Sobociński [3, 4]. The main concept behind adhesive categories are the so-called van Kampen squares, which en...
متن کاملAdhesive Categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Double-pushout graph rewriting generalises well to rewriting on arbitrary adhesive categories.
متن کاملCategorical Frameworks for Graph Transformation and HLR Systems Based on the DPO Approach
Several variants of high-level replacement (HLR) and adhesive categories have been introduced in the literature as categorical frameworks for graph transformation and HLR systems based on the double pushout (DPO) approach. In addition to HLR, adhesive, and adhesive HLR categories several weak variants, especially weak adhesive HLR with horizontal and vertical variants, as well as partial varian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 39 شماره
صفحات -
تاریخ انتشار 2005